Smaller Abstractions for ∀CTL without Next
نویسندگان
چکیده
The success of applying model-checking to large systems depends crucially on the choice of good abstractions. In this work we present an approach for constructing abstractions when checking Nextfree universal CTL properties. It is known that functional abstractions are safe and that Next-free universal CTL is insensitive to finite stuttering. We exploit these results by introducing a safe Next-free abstraction that is typically smaller than the usual functional one while at the same time more precise, i.e., it has less spurious counter-examples.
منابع مشابه
Abstract Family-based Model Checking using Modal Featured Transition Systems: Preservation of CTL* (Extended Version)
Family-based Model Checking using Modal Featured Transition Systems: Preservation of CTL (Extended Version) Aleksandar S. Dimovski Faculty of Informatics, Mother Teresa University, Skopje, Mkd Abstract. Variational systems allow effective building of many custom variants by using features (configuration options) to mark the variable functionality. In many of the applications, their quality assu...
متن کاملCreating a Demarcation Point Between Content Production and Encoding in a Digital Classroom
Incorporating a significant amount of technology into a classroom is an important, but extremely difficult task. In this paper we describe the next generation of the UCSB digital classroom, called the Collaborative Technologies Lab (CTL). The primary goal of the CTL is to investigate the challenges of deploying technology for technology’s sake. We feel that without the ability to deploy a large...
متن کاملBisimilar Finite Abstractions of Interconnected Systems
This paper addresses the design of approximately bisimilar finite abstractions of systems that are composed of the interconnection of smaller subsystems. First, it is shown that the ordinary notion of approximate bisimulation does not preserve the interconnection structure of the concrete model. Next, a new definition of approximate bisimulation that is compatible with interconnection is propos...
متن کاملComputing Stuttering Simulations
Stuttering bisimulation is a well-known behavioural equivalence that preserves CTL-X, namely CTL without the next-time operator X. Correspondingly, the stuttering simulation preorder induces a coarser behavioural equivalence that preserves the existential fragment ECTL-{X,G}, namely ECTL without the next-time X and globally G operators. While stuttering bisimulation equivalence can be computed ...
متن کاملVerification and Refutation of Probabilistic Specifications via Games
We develop an abstraction-based framework to check probabilistic specifications of Markov Decision Processes (MDPs) using the stochastic two-player game abstractions (i.e. “games”) developed by Kwiatkowska et al. as a foundation. We define an abstraction preorder for these game abstractions which enables us to identify many new game abstractions for each MDP — ranging from compact and imprecise...
متن کامل